Median problem in some plane triangulations and quadrangulations
نویسندگان
چکیده
Résumé In this note, we present linear time algorithms for computing the median set of plane triangulations with inner vertices of degree ≥ 6 and plane quadrangulations with inner vertices of degree ≥ 4. Dans cette note, nous présentons un algorithme linéaire pour calculer l’ensemble médian de triangulations planaires dont les sommets intérieurs sont de degré ≥ 6 et de quadrangulations planaires dont les sommets intérieurs sont de degré ≥ 4. Relecteurs/Reviewers: Nadia Creignou, Michel Van Caneghem
منابع مشابه
A binary labelling for plane Laman graphs and quadrangulations
We provide binary labellings for the angles of quadrangulations and plane Laman graphs which are in analogy with Schnyder labellings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990].
متن کاملA binary labeling for plane Laman graphs and quadrangulations
We present binary labelings for the angles of quadrangulations and plane Laman graphs, which are in analogy with Schnyder labelings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990] and imply a special tree decomposition for quadrangulations. In particular, we show how to embed quadrangulations on a 2-book, so that each page contains a non-crossing alte...
متن کاملInterval routing in some planar networks
In this article, we design optimal or near optimal interval routing schemes (IRS, for short) with small compactness for several classes of plane quadrangulations and triangulations (by optimality or near optimality we mean that messages are routed via shortest or almost shortest paths). We show that the subgraphs of the rectilinear grid bounded by simple circuits allow optimal IRS with at most ...
متن کاملA bijection for triangulations, quadrangulations, pentagulations, etc
A d-angulation is a planar map with faces of degree d. We present for each integer d ≥ 3 a bijection between the class of d-angulations of girth d and a class of decorated plane trees. Each of the bijections is obtained by specializing a “master bijection” which extends an earlier construction of the first author. Bijections already existed for triangulations (d = 3) and for quadrangulations (d...
متن کاملBinary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for triangulations: Apart from being in bijection with tree decompositions, paths in these trees allow ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 27 شماره
صفحات -
تاریخ انتشار 2004